Linear Code Implies Public-Key Traitor Tracing
نویسندگان
چکیده
Abstract. In this paper, we first show that three public-key (k, n)-traceability schemes can be derived from an [n, u, d]-linear code C such that d ≥ 2k + 1. The previous schemes are obtained as special cases. This observation gives a more freedom and a new insight to this field. For example, we show that BonehFranklin scheme is equivalent to a slight modification of the corrected KurosawaDesmedt scheme. This means that BF scheme is redundant or overdesigned because the modified KD scheme is much simpler. It is also shown that the corrected KD scheme is the best among them.
منابع مشابه
Copyrighting Public-key Functions and Applications to Black-box Traitor Tracing
Copyrighting a function is the process of embedding hard-to-remove marks in the function’s implementation while retaining its original functionality. Here we consider the above problem in the context of public-key encryption and we parallel the process of copyrighting a function to the process of designing traitor tracing schemes. We derive two copyrighted public-key encryption functions for th...
متن کاملTraitor Tracing against Public Collaboration
Broadcast encryption provides a convenient method to distribute digital content to subscribers over an insecure broadcast channel. Traitor tracing is needed because some users may give out their decryption keys to construct pirate decoders. There are many traitor tracing schemes based on collusion secure codes and identifiable parent property codes. However, these schemes are subject to public ...
متن کاملTraitor Tracing with Constant Transmission Rate
An important open problem in the area of Traitor Tracing is designing a scheme with constant expansion of the size of keys (users’ keys and the encryption key) and of the size of ciphertexts with respect to the size of the plaintext. This problem is known from the introduction of Traitor Tracing by Chor, Fiat and Naor. We refer to such schemes as traitor tracing with constant transmission rate....
متن کاملGeneric Construction of Trace and Revoke Schemes
Broadcast encryption (BE) is a cryptographic primitive that allows a broadcaster to encrypt digital content to a privileged set of users and in this way prevent revoked users from accessing the content. In BE schemes, a group of users, called traitors may leak their keys and enable an adversary to receive the content. Such malicious users can be detected through traitor tracing (TT) schemes. Th...
متن کاملA Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares
We proposed a new public-key traitor tracing scheme with revocation capability using the dynamic share and entity revocation techniques. The enabling block of our scheme is independent of the number of subscribers, but dependent on the collusion and revocation thresholds. Each receiver holds one decryption key only. Our traitor tracing algorithm works in a black-box way and is conceptually simp...
متن کامل